High-Performance Architecture for Binary-Tree-Based Finite State Machines
نویسندگان
چکیده
منابع مشابه
A Dedicated Reconfigurable Architecture for Finite State Machines
For ultra-low-power sensor networks, finite state machines are used for simple tasks where the system’s microprocessor would be overqualified. This allows the microprocessor to remain in a sleep state, thus saving energy. This paper presents a new architecture that is specifically optimized for implementing reconfigurable Finite State Machines: Transition-based Reconfigurable FSM (TR-FSM). The ...
متن کاملEasily testable PLA-based finite state machines
the area and timing penalty associated with LSSD techniques are not acceptable to designers. In this paper, we outline a synthesis procedure, which Logic synthesis and minimization techniques can, in beginning from a State Transition Graph description principle, ensure fully and easily testable combinational of a sequential machine, produces an optimized easily and sequential circuit designs. I...
متن کاملLearning Finite State Machines
The terms grammatical inference and grammar induction both seem to indicate that techniques aiming at building grammatical formalisms when given some information about a language are not concerned with automata or other finite state machines. This is far from true, and many of the more important results in grammatical inference rely heavily on automata formalisms, and particularly on determinis...
متن کاملFinite state machines
Finite State Machines, in short FSMs, are formalisms that have been used for decades to describe the behavior of systems. They can also provide an intelligent agent with a suitable formalism for describing its own beliefs about the behavior of the world surrounding it. In fact, FSMs are the suitable acceptors for right linear languages, which are the simplest languages considered in Chomsky’s c...
متن کاملSynthesis for Testability of Pla Based Finite State Machines
In this paper we state the relationship that output vectors of any true-faulty state pair must satisfy for the fault to be detectable at the primary outputs in one clock cycle. As an application, a new hardware scheme for easily testable PLA-based FSMs is proposed. With our scheme, all combinationally irredundant faults in the PLA which result in unidirectional errors are testable. Moreover, te...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
سال: 2018
ISSN: 0278-0070,1937-4151
DOI: 10.1109/tcad.2017.2731678